Hamiltonian and long paths in bipartite graphs with connectivity

Let G be a graph, $\nu (G)$ the order of G, $\kappa (G)$ the connectivity of G and k a positive integer such that $k\le (\nu (G)?2)/2$. Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets $V_1$ and $V_2$ is defined to be Hamiltonian-laceable if such that $|V_1|=|V_2|$ and for every pair of vertices $p\in V_1$ and $q\in V_2$, there exists a Hamiltonian path in G with endpoints p and q, or $|V_1|=|V_2|+1$ and for every pair of vertices $p,q\in V_1,p\ne q$, there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition $(X,Y)$. Define $bn(G)$ to be a maximum integer such that $0\le bn(G)<min\{|X|,|Y|\}$ and (1) for each non-empty subset S of X, if $|S|\le |X|?bn(G)$, then $|N(S)|\ge |S|+bn(G)$, and if $|X|?bn(G)<|S|\le |X|$, then $N(S)=Y$; and (2) for each non-empty subset S of Y, if $|S|\le |Y|?bn(G)$, then $|N(S)|\ge |S|+bn(G)$, and if $|Y|?bn(G)<|S|\le |Y|$, then $N(S)=X$; and (3) $bn(G)=0$ if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition $(X,Y)$ such that $|X|=|Y|$ and $bn(G)>0$. In this paper, we show that if $\nu (G)\le 2\kappa (G)+4bn(G)?4$, then G is Hamiltonian-laceable; or if $\nu (G)>6bn(G)?2$, then for every pair of vertices $x\in X$ and $y\in Y$, there is an $(x,y)$-path P in G with $|V(P)|\ge 6bn(G)?2$. We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs.     

FeCoCrCuNi高熵合金裂纹及孔洞结构力学与微观构象演化机理的分子动力学模拟研究

本文采用分子动力学方法研究了FeCoCrCuNi高熵合金裂纹及孔洞模型结构在不同轴向拉伸应变速率下的力学与微观结构演化机理. 结果表明：应变速率越高FeCoCrCuNi裂纹结构对应更高的过冲应变和过冲应力，其主要原因是高拉伸速率会导致高强度的BCC结构及孪晶结构的生成，而BCC结构及孪晶结构的产生进而会抑制应力的下降，通过应力-应变曲线，可知FeCoCrCuNi裂纹模型在轴向应力作用下表现为塑性形变. 对于不同尺寸的孔洞FeCoCrCuNi裂纹模型的应力模拟与结构分析，可以得出：孔洞尺寸越大, FeCoCrCuNi裂纹结构对应的过冲应变和过冲应力越小，其主要原因是大尺寸的孔洞造成孔洞之间产生裂纹的，进而会影响这个材料的屈服应变和屈服强度.     

The Application of Fractal Transform and Entropy for Improving Fault Tolerance and Load Balancing in Grid Computing Environments

This paper applies the entropy-based fractal indexing scheme that enables the grid environment for fast indexing and querying. It addresses the issue of fault tolerance and load balancing-based fractal management to make computational grids more effective and reliable. A fractal dimension of a cloud of points gives an estimate of the intrinsic dimensionality of the data in that space. The main drawback of this technique is the long computing time. The main contribution of the suggested work is to investigate the effect of fractal transform by adding R-tree index structure-based entropy to existing grid computing models to obtain a balanced infrastructure with minimal fault. In this regard, the presented work is going to extend the commonly scheduling algorithms that are built based on the physical grid structure to a reduced logical network. The objective of this logical network is to reduce the searching in the grid paths according to arrival time rate and path’s bandwidth with respect to load balance and fault tolerance, respectively. Furthermore, an optimization searching technique is utilized to enhance the grid performance by investigating the optimum number of nodes extracted from the logical grid. The experimental results indicated that the proposed model has better execution time, throughput, makespan, latency, load balancing, and success rate.     

Cross-polarization with magic-angle spinning kinetics and impedance spectroscopy study of proton mobility,local disorder,and thermal equilibration in hydrogen-bonded poly(methacrylic acid)

The ¹H–¹³C cross-polarization with magic-angle spinning (CP MAS) kinetics was studied in poly(methacrylic acid) (PMAA) having the purpose to track the links between the local order in the main chain and the proton dynamics in peripheral hydrogen bond networks. The experimental CP MAS kinetic curves were analyzed applying the models of isotropic and anisotropic spin-diffusion with thermal equilibration. The fractal dimension D_p ≈ 3 was deduced that indicates that PMAA behaves as an isotropic 3D-system. No proton conductivity in the neat PMAA was deduced from the impedance spectroscopy data analyzing the frequency dependences of the complex dielectric permittivity. The value of local order parameter S = 0.70 for CH₂ in PMAA occupies an intermediate position between 0.63 and 0.85 deduced for CH₂ sites in the main chains of poly(vinyl phosphonic acid) and poly(2-hydroxyethyl methacrylate), that is, the true proton conductor and the polymer that contains the H-bond network, however, no proton conductivity, respectively.     

Monochromatic k-edge-connection colorings of graphs

A path in an edge-colored graph $G$ is called monochromatic if any two edges on the path have the same color. For $k\ge 2$, an edge-colored graph $G$ is said to be monochromatic $k$-edge-connected if every two distinct vertices of $G$ are connected by at least $k$ edge-disjoint monochromatic paths, and $G$ is said to be uniformly monochromatic $k$-edge-connected if every two distinct vertices are connected by at least $k$ edge-disjoint monochromatic paths such that all edges of these $k$ paths are colored with a same color. We use $m{c}_k\left(G\right)$ and $um{c}_k\left(G\right)$ to denote the maximum number of colors that ensures $G$ to be monochromatic $k$-edge-connected and, respectively, $G$ to be uniformly monochromatic $k$-edge-connected. In this paper, we first conjecture that for any $k$-edge-connected graph $G$, $m{c}_k\left(G\right)=e\left(G\right)-e\left(H\right)+\lfloor \frac{k}{2}\rfloor$, where $H$ is a minimum $k$-edge-connected spanning subgraph of $G$. We verify the conjecture for $k=2$. We also prove the conjecture for $G=K_{k+1}$ and $G=K_{k,n}$ with $n\ge k\ge 3$. When $G$ is a minimal $k$-edge-connected graph, we give an upper bound of $m{c}_k\left(G\right)$, i.e., $m{c}_k\left(G\right)\le k-1$. For the uniformly monochromatic $k$-edge-connectivity, we prove that for all $k$, $um{c}_k\left(G\right)=e\left(G\right)-e\left(H\right)+1$, where $H$ is a minimum $k$-edge-connected spanning subgraph of $G$.     

航空导管弯曲试验的疲劳裂纹萌生寿命

飞行器液压导管受接头和卡箍等约束，在使用的振动环境中，会因弯曲应力而导致破裂，影响到飞行安全．本文对飞行器液压系统通用的不锈钢导管的裂纹萌生寿命进行了试验研究．首先在对8 mm、12 mm 无缺陷导管和含U 型缺口8 mm 导管的疲劳试验和有限元分析的基础上，得到了导管的最大拉应变-裂纹萌生寿命数据．然后采用基于强度极限和弹性模量估算法的Manson-Coffin 公式来预测导管裂纹萌生寿命．最后引入加载类型修正系数、表面质量修正系数、试样尺寸修正系数、应力集中敏感系数和有效应力集中系数，使修正后的公式对三种类型的导管均有较好的裂纹萌生寿命预测精度．     

水力劈裂问题的态型近场动力学建模

将态型近场动力学理论引入水力劈裂问题的模拟。构建了能反映岩土类材料准脆性断裂特征的态型近场动力学本构模型,并在物质点间相互作用力模型中加入等效水压力项,以实现在新生裂纹面上跟踪施加水压力。同时,考虑裂纹面间的接触,引入物质点间的短程排斥力作用,并设计了相应的接触算法。通过自编程序将模型和算法应用于含初始裂纹、不含初始裂纹以及含坝基软弱结构面的混凝土重力坝在高水头作用下的水力劈裂过程模拟,并与扩展有限元等模拟结果对比,验证了本文模型和算法的可行性和准确性。